Optimization Based Globally Convergent Methods for the Nonlinear Complementarity Problem
نویسندگان
چکیده
The nonlinear complementarity problem has been used to study and formulate various equilibrium problems including the traffic equilibrium problem, the spatial equilibrium problem and the Nash equilibrium problem. To solve the nonlinear complementarity problem, various iterative methods such as projection methods, linearized methods and Newton method have been proposed and their convergence results have been established. In this paper, we propose globally convergent methods based on differentiable optimization formulation of the problem. The methods are applications of a recently proposed method for solving variational inequality problems, but they take full advantage of the special structure of nonlinear complementarity problem. We establish global convergence of the proposed methods, which is a refinement of the results obtained for variational inequality counterparts. Some computational experience indicates that the proposed methods are practically efficient.
منابع مشابه
A Truly Globally Convergent Newton-Type Method for the Monotone Nonlinear Complementarity Problem
متن کامل
Improving the convergence of non-interior point algorithms for nonlinear complementarity problems
Recently, based upon the Chen-Harker-Kanzow-Smale smoothing function and the trajectory and the neighbourhood techniques, Hotta and Yoshise proposed a noninterior point algorithm for solving the nonlinear complementarity problem. Their algorithm is globally convergent under a relatively mild condition. In this paper, we modify their algorithm and combine it with the superlinear convergence theo...
متن کاملA Global Linear and Local Quadratic Noninterior Continuation Method for Nonlinear Complementarity Problems Based on Chen-Mangasarian Smoothing Functions
A non-interior continuation method is proposed for nonlinear complementarity problems. The method improves the non-interior continuation methods recently studied by Burke and Xu 1] and Xu 29]. Our deenition of neighborhood for the central path is simpler and more natural. In addition, our continuation method is based on a broader class of smooth functions introduced by Chen and Mangasarian 7]. ...
متن کاملA Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems
Abstract. The Second-Order Cone Complementarity Problem (SOCCP) is a wide class of problems containing the Nonlinear Complementarity Problem (NCP) and the Second-Order Cone Programming Problem (SOCP). Recently, Fukushima, Luo and Tseng extended some merit functions and their smoothing functions for NCP to SOCCP. Moreover, they derived computable formulas for the Jacobians of the smoothing funct...
متن کاملA New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
We investigate the properties of a new merit function which allows us to reduce a nonlinear complementarity problem to an unconstrained global minimization one. Assuming that the complementarity problem is deened by a P 0-function we prove that every stationary point of the unconstrained problem is a global solution; furthermore, if the complementarity problem is deened by a uniform P-function,...
متن کامل